Admissible heuristic

Results: 82



#Item
31A Beginner’s Introduction to Heuristic Search Planning 6. Delete Relaxation and Landmarks Malte Helmert  Gabriele R¨

A Beginner’s Introduction to Heuristic Search Planning 6. Delete Relaxation and Landmarks Malte Helmert Gabriele R¨

Add to Reading List

Source URL: ai.cs.unibas.ch

Language: English - Date: 2015-01-20 05:17:56
32New Optimization Functions for Potential Heuristics Jendrik Seipp and Florian Pommerening and Malte Helmert University of Basel Basel, Switzerland {jendrik.seipp,florian.pommerening,malte.helmert}@unibas.ch

New Optimization Functions for Potential Heuristics Jendrik Seipp and Florian Pommerening and Malte Helmert University of Basel Basel, Switzerland {jendrik.seipp,florian.pommerening,malte.helmert}@unibas.ch

Add to Reading List

Source URL: ai.cs.unibas.ch

Language: English - Date: 2015-03-25 10:19:25
33Optimal Planning for Delete-free Tasks with Incremental LM-cut Florian Pommerening Malte Helmert  Albert-Ludwigs-Universit¨at Freiburg

Optimal Planning for Delete-free Tasks with Incremental LM-cut Florian Pommerening Malte Helmert Albert-Ludwigs-Universit¨at Freiburg

Add to Reading List

Source URL: ai.cs.unibas.ch

Language: English - Date: 2013-01-07 17:29:29
34

PDF Document

Add to Reading List

Source URL: www.cis.strath.ac.uk

Language: English - Date: 2007-09-05 10:42:25
35

PDF Document

Add to Reading List

Source URL: www.cis.strath.ac.uk

Language: English - Date: 2008-06-25 17:50:35
36

PDF Document

Add to Reading List

Source URL: www.ieor.berkeley.edu

Language: English - Date: 2014-05-28 11:56:44
37Combinatorics / A* search algorithm / Heuristic function / Goal node / Breadth-first search / Admissible heuristic / Heuristic / Greedy algorithm / Algorithm / Search algorithms / Mathematics / Artificial intelligence

Mean-based Heuristic Search for Real-Time Planning #ID 1 Résumé : In this paper, we introduce a new heuristic search algorithm based on mean values for realtime planning, called MHSP. It consists in associating the pri

Add to Reading List

Source URL: www.math-info.univ-paris5.fr

Language: English - Date: 2012-07-06 09:32:23
38An UCT Approach for Anytime Agent-based Planning Damien Pellier, Bruno Bouzy, and Marc M´etivier Abstract In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MH

An UCT Approach for Anytime Agent-based Planning Damien Pellier, Bruno Bouzy, and Marc M´etivier Abstract In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MH

Add to Reading List

Source URL: www.math-info.univ-paris5.fr

Language: English - Date: 2012-07-06 09:32:23
39Security Checklist for Teleworkers Anti-virus Software Anti-virus application is installed and is configured to do the following: • • •

Security Checklist for Teleworkers Anti-virus Software Anti-virus application is installed and is configured to do the following: • • •

Add to Reading List

Source URL: www.iwar.org.uk

Language: English - Date: 2008-11-19 05:52:22
40A New Approach for Continual Planning (Extended Abstract) Damien Pellier Humbert Fiorino

A New Approach for Continual Planning (Extended Abstract) Damien Pellier Humbert Fiorino

Add to Reading List

Source URL: www.math-info.univ-paris5.fr

Language: English - Date: 2013-08-29 16:29:43